Barbosa, Uniform Polynomial Time Bounds, and Promises

نویسندگان

  • Lane A. Hemaspaandra
  • Kyle Murray
  • Xiaoqing Tang
چکیده

This note is a commentary on, and critique of, André Luiz Barbosa’s paper entitled “P != NP Proof.” Despite its provocative title, what the paper is seeking to do is not to prove P 6= NP in the standard sense in which that notation is used in the literature. Rather, Barbosa is (and is aware that he is) arguing that a different meaning should be associated with the notation P 6= NP, and he claims to prove the truth of the statement P 6= NP in his quite different sense of that statement. However, we note that (1) the paper fails even on its own terms, as due to a uniformity problem, the paper’s proof does not establish, even in its unusual sense of the notation, that P 6= NP; and (2) what the paper means by the claim P 6= NP in fact implies that P 6= NP holds even under the standard meaning that that notation has in the literature (and so it is exceedingly unlikely that Barbosa’s proof can be fixed any time soon).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Non-Uniform Lower Bounds for Uniform Classes

We strengthen the nondeterministic hierarchy theorem for non-deterministic polynomial time to show that the lower bound holds against sub-linear advice. More formally, we show that for any constants d and d′ such that 1 6 d < d′, and for any time-constructible bound t = o(n), there is a language in NTIME(n) which is not in NTIME(t)/n1/d . The best known earlier separation of Fortnow, Santhanam ...

متن کامل

A method to obtain the best uniform polynomial approximation for the family of rational function

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

متن کامل

Lower Bounds against Weakly Uniform Circuits

A family of Boolean circuits {Cn}n>0 is called γ(n)-weakly uniform if there is a polynomial-time algorithm for deciding the directconnection language of every Cn, given advice of size γ(n). This is a relaxation of the usual notion of uniformity, which allows one to interpolate between complete uniformity (when γ(n) = 0) and complete nonuniformity (when γ(n) > |Cn|). Weak uniformity is essential...

متن کامل

Lower Bounds for Uniform Constant Depth Circuits by Vivek Kashinath Gore

OF THE DISSERTATION Lower Bounds for Uniform Constant Depth Circuits by Vivek Kashinath Gore, Ph.D. Dissertation Director: Professor Eric Allender Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A big advantage of studying Boolean circuits is that they can be viewed as simple combinatorial objects and thus allow us to use many algebraic and com...

متن کامل

The best uniform polynomial approximation of two classes of rational functions

In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1106.1150  شماره 

صفحات  -

تاریخ انتشار 2011